Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
521	CS 330 – Spring 2013, Assignment 5 Assignments due at the beginning of class (11AM), Thursday, April 5 Question[removed]pts). Chapter 6, Exercise 8, on p[removed]Question[removed]pts). Chapter 6, Exercise 10, on p[removed]Ques Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-03-21 14:14:43 Analysis of algorithms Algorithm Mathematical logic Partition problem Time complexity NP Theoretical computer science Computational complexity theory Applied mathematics
522	Space Dilation in Polynomial-Time Perceptron Algorithms Andriy Kharechko∗† [removed] Abstract This talk surveys applications of space dilation in the perceptron-like algorithms for solving systems of linear inequa Add to Reading List Source URL: eprints.pascal-network.org Language: English - Date: 2011-11-30 10:22:02 Operations research Convex optimization Linear programming Combinatorial optimization Computational complexity theory Ellipsoid method Perceptron Mathematical optimization Time complexity Theoretical computer science Applied mathematics Mathematics
523	A Calculational Approach to Program Inversion Shin-Cheng Mu Linacre College 23rd January 2003 Add to Reading List Source URL: www.iis.sinica.edu.tw Language: English - Date: 1969-12-31 19:00:00 Operations research Mathematical optimization Mathematical logic Analysis of algorithms Algorithm RSA Dynamic programming Tree traversal Time complexity Mathematics Theoretical computer science Applied mathematics
524	Location, Location, Location—The Role of Spatial Locality in Asymptotic Energy Minimization Add to Reading List Source URL: ic.ese.upenn.edu Language: English - Date: 2012-12-07 21:21:13 Computational complexity theory Mathematics Asymptotically optimal algorithm Field-programmable gate array Parallel computing Time complexity Big O notation Circuit complexity Reconfigurable computing Analysis of algorithms Applied mathematics Computer science
525	Map-Reduce for Machine Learning on Multicore Cheng-Tao Chu ∗ [removed] Sang Kyun Kim ∗ [removed] Add to Reading List Source URL: www.cs.stanford.edu Language: English - Date: 2007-04-03 19:22:00 Multivariate statistics Learning Statistical classification Expectation–maximization algorithm Support vector machine Principal component analysis Machine learning Algorithm Time complexity Statistics Regression analysis Estimation theory
526	I/O-algorithms Project 1 — I/O-efficient merge-sort Spring 2007 Add to Reading List Source URL: www.daimi.au.dk Language: English - Date: 2007-02-05 07:02:39 Theoretical computer science External sorting Quicksort Heapsort Priority queue Time complexity Algorithm Input/output Merge sort Sorting algorithms Mathematics Order theory
527	Map-Reduce for Machine Learning on Multicore Cheng-Tao Chu ∗ [removed] Sang Kyun Kim ∗ [removed] Add to Reading List Source URL: www.jaso.co.kr Language: English - Date: 2014-02-28 05:22:29 Multivariate statistics Learning Statistical classification Expectation–maximization algorithm Support vector machine Principal component analysis Machine learning Algorithm Time complexity Statistics Regression analysis Estimation theory
528	P, N P and Mathematics – a computational complexity perspective Avi Wigderson “P versus N P – a gift to mathematics from Computer Science” Steve Smale. Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2006-03-15 13:50:29 Complexity classes Mathematical optimization Structural complexity theory Mathematical logic P NP-complete Decision problem Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
529	Exact Algorithms and Fixed-Parameter Tractability Summary of Dagstuhl Seminar[removed]July–29. July 2005 Rod Downey 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-19 05:18:59 NP-complete problems Analysis of algorithms Matroid theory Parameterized complexity Complexity classes Clique problem Vertex cover Time complexity Matroid Theoretical computer science Computational complexity theory Mathematics
530	Approaching Optimality For Solving SDD Linear Systems Ioannis Koutis Carnegie Mellon University Email: [removed] Gary L. Miller Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2010-08-23 12:08:01 NP-complete problems Spanning tree Line graph Time complexity Planar graph Graph partition Minor Trapezoid graph Eulerian path Graph theory Theoretical computer science Mathematics

UPDATE